#include<bits/stdc++.h>
using namespace std;
int n,r[100005],i,rests;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    rests=n;
    for(i=1;i<=n;i++){
        scanf("%d",&r[i]);
    }
    sort(r+1,r+n+1);
    int k=1;
    for(i=2;i<=n;i++){
        if(r[k]<r[i]){
            rests--;
            k++;
        }
    }
    printf("%d",rests);
    return 0;
}
